ZZZ (working) / Monomial (Bibtex)

P211: Enumeration of all monomials

Input:

A polynomial $P$ with $n$ variables, $t$ monomials, and a total degree $D$.

Output:

All monomials of $P$.

Complexity:

$O(D^2n^2\log(n)(n+\log(1/\epsilon))))$ delay.

Comment:

Reference:

[Strozecki2010a] (Bibtex)

P212: Enumeration of all monomials

Input:

A polynomial $P$ with $n$ variables, $t$ monomials, and a total degree $D$.

Output:

All monomials of $P$.

Complexity:

The delay between $i$th and $i+1$th outputted monomials is bounded by $O(iDn^2(n+\log(1/\epsilon)))$.

Comment:

Reference:

[Strozecki2010a] (Bibtex)